Properties and constraints of cheating-immune secret sharing schemes

Properties and constraints of cheating-immune secret sharing schemes

A secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualiied subsets. The setting we consider is the following: in a rst phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qua...

On Cheating Immune Secret Sharing

This work addresses the problem of cheating prevention in secret sharing. The scheme is said to be k-cheating immune if any group of k cheaters has no advantage over honest participants. In this paper we study the constraints of cheating immune secret sharing schemes. We give a necessary and sufficient condition for SSSs to be cheating immune. Then, we improve the upper bound of D’Arco et. al o...

On Cheating Immune Secret Sharing

The paper addresses the cheating prevention in secret sharing. We consider secret sharing with binary shares. The secret also is binary. This model allows us to use results and constructions from the well developed theory of cryptographically strong boolean functions. In particular, we prove that for given secret sharing, the average cheating probability over all cheating vectors and all origin...

Cheating Prevention in Secret Sharing Schemes

We present two new algorithms for making secret sharing cheating immune. The first algorithm modifies Shamir’s scheme to make it k−2 cheating immune and requires no additional storage. The second proposed algorithm provides k−1 cheating immunity under computational assumptions and requires a small constant size additional storage. Here k is the minimum number of players that have to pool their ...

Constructions of Cheating Immune Secret Sharing